An Efficient Image Segmentation Algorithm Using Neutrosophic Graph Cut
نویسندگان
چکیده
منابع مشابه
An Efficient Image Segmentation Algorithm Using Neutrosophic Graph Cut
Segmentation is considered as an important step in image processing and computer vision applications, which divides an input image into various non-overlapping homogenous regions and helps to interpret the image more conveniently. This paper presents an efficient image segmentation algorithm using neutrosophic graph cut (NGC). An image is presented in neutrosophic set, and an indeterminacy filt...
متن کاملImage Segmentation by Using Graph Cut Method
Image segmentation is used in Image Processing. Seed-based methods for region based image segmentation are known to provide the results for a few applications, being usually easy to extend to multidimensional images. The region growing procedure is finished by image foresting transformation which develops the initial seed region by finding the close by pixels identified with seed region. To exa...
متن کاملMultiregion Graph Cut Image Segmentation
The purpose of our study is two-fold: (1) investigate an image segmentation method which combines parametric modeling of the image data and graph cut combinatorial optimization and, (2) use a prior which allows the number of labels/regions to decrease when the number of regions is not known and the algorithm initialized with a larger number. Experimental verification shows that the method resul...
متن کاملAn Efficient Parallel Algorithm for Graph-Based Image Segmentation
Automatically partitioning images into regions (‘segmentation’) is challenging in terms of quality and performance. We propose a Minimum Spanning Tree-based algorithm with a novel graph-cutting heuristic, the usefulness of which is demonstrated by promising results obtained on standard images. In contrast to data-parallel schemes that divide images into independently processed tiles, the algori...
متن کاملJoint graph cut and relative fuzzy connectedness image segmentation algorithm
We introduce an image segmentation algorithm, called GC(sum)(max), which combines, in novel manner, the strengths of two popular algorithms: Relative Fuzzy Connectedness (RFC) and (standard) Graph Cut (GC). We show, both theoretically and experimentally, that GC(sum)(max) preserves robustness of RFC with respect to the seed choice (thus, avoiding "shrinking problem" of GC), while keeping GC's s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2017
ISSN: 2073-8994
DOI: 10.3390/sym9090185